Adaptive Neighbor Detection for Mobile Ad Hoc Networks

One critical issue of MANET is to improve packet delivery in presence of network dynamics. Proactive MANET routing protocols tend to provide smaller route discovery latency than ondemand protocols because they maintain route information to all the nodes in the network at all time. However, the downside for such protocols is the excessive routing control overhead generated by disseminating periodic HELLO messages and topology control messages. Due to the resource-constrained nature of wireless networks, the routing overhead increases channel contention, leads to network congestions and lowers significantly network performance. In order to mitigate the side effects of the soft update control overheads, we propose an adaptive neighbor detection algorithm for MANET routing protocols, namely DT MIAD. By tuning the value of refresh intervals dynamically and automatically, refresh updates are triggered based on traffic conditions and node mobility. We have shown through simulations that, the proposed adaptive routing algorithm outperforms traditional proactive routing protocols like OLSR. Adaptive Neighbor Detection for Mobile Ad Hoc Networks Yangcheng Huang Department of Computer Science University College London Gower Street, London WC1E 6BT Email: [email protected] Saleem Bhatti School of Computer Science University of St. Andrews St. Andrews, UK Email: [email protected] Søren-Aksel Sørensen Department of Computer Science University College London Gower Street, London WC1E 6BT Email: [email protected] Abstract— One critical issue of MANET is to improve packet delivery in presence of network dynamics. Proactive MANET routing protocols tend to provide smaller route discovery latency than on-demand protocols because they maintain route information to all the nodes in the network at all time. However, the downside for such protocols is the excessive routing control overhead generated by disseminating periodic HELLO messages and topology control messages. Due to the resource-constrained nature of wireless networks, the routing overhead increases channel contention, leads to network congestions and lowers significantly network performance. In order to mitigate the side effects of the soft update control overheads, we propose an adaptive neighbor detection algorithm for MANET routing protocols, namely DT MIAD. By tuning the value of refresh intervals dynamically and automatically, refresh updates are triggered based on traffic conditions and node mobility. We have shown through simulations that, the proposed adaptive routing algorithm outperforms traditional proactive routing protocols like OLSR. One critical issue of MANET is to improve packet delivery in presence of network dynamics. Proactive MANET routing protocols tend to provide smaller route discovery latency than on-demand protocols because they maintain route information to all the nodes in the network at all time. However, the downside for such protocols is the excessive routing control overhead generated by disseminating periodic HELLO messages and topology control messages. Due to the resource-constrained nature of wireless networks, the routing overhead increases channel contention, leads to network congestions and lowers significantly network performance. In order to mitigate the side effects of the soft update control overheads, we propose an adaptive neighbor detection algorithm for MANET routing protocols, namely DT MIAD. By tuning the value of refresh intervals dynamically and automatically, refresh updates are triggered based on traffic conditions and node mobility. We have shown through simulations that, the proposed adaptive routing algorithm outperforms traditional proactive routing protocols like OLSR.